A Survey on Trapping Sets and Stopping Sets

نویسندگان

  • Aiden Price
  • Joanne Hall
چکیده

LDPC codes are used in many applications, however, their error correcting capabilities are limited by the presence of stopping sets and trappins sets. Trappins sets and stopping sets occur when specific low-wiehgt error patterns cause a decoder to fail. Trapping sets were first discovered with investigation of the error floor of the Margulis code. Possible solutions are constructions which avoid creating trapping sets, such as progressive edge growth (PEG), or methods which remove trapping sets from existing constructions, such as graph covers. This survey examines trapping sets and stopping sets in LDPC codes over channels such as BSC, BEC and AWGNC.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Manifestation of Stopping Sets and Absorbing Sets as Deviations on the Computation Trees of LDPC Codes

The error mechanisms of iterative message-passing decoders for low-density parity-check codes are studied. A tutorial review is given of the various graphical structures, including trapping sets, stopping sets, and absorbing sets that are frequently used to characterize the errors observed in simulations of iterative decoding of low-density parity-check codes. The connections between trapping s...

متن کامل

Asymptotic Average Number of Different Categories of Trapping Sets, Absorbing Sets and Stopping Sets in Random Regular and Irregular LDPC Code Ensembles

The performance of low-density parity-check (LDPC) codes in the error floor region is closely related to some combinatorial structures of the code’s Tanner graph, collectively referred to as trapping sets (TSs). In this paper, we study the asymptotic average number of different types of trapping sets such as elementary TSs (ETS), leafless ETSs (LETS), absorbing sets (ABS), elementary ABSs (EABS...

متن کامل

Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes

The performance of low-density parity-check (LDPC) codes over the binary erasure channel for a low erasure probability is limited by small stopping sets. The frame error rate over the additive white Gaussian noise (AWGN) channel for a high signal-to-noise ratio is limited by small trapping sets and by the minimum distance of the LDPC code, which is equal to the codeword with the minimal Hamming...

متن کامل

Characterization and Efficient Search of Non-Elementary Trapping Sets of LDPC Codes with Applications to Stopping Sets

In this paper, we propose a characterization for non-elementary trapping sets (NETSs) of lowdensity parity-check (LDPC) codes. The characterization is based on viewing a NETS as a hierarchy of embedded graphs starting from an ETS. The characterization corresponds to an efficient search algorithm that under certain conditions is exhaustive. As an application of the proposed characterization/sear...

متن کامل

Exhausting Error-Prone Patterns in LDPC Codes

It is proved in this work that exhaustively determining bad patterns in arbitrary, finite low-density paritycheck (LDPC) codes, including stopping sets for binary erasure channels (BECs) and trapping sets (also known as nearcodewords) for general memoryless symmetric channels, is an NP-complete problem, and efficient algorithms are provided for codes of practical short lengths n ≈ 500. By explo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1705.05996  شماره 

صفحات  -

تاریخ انتشار 2017